Stable Conjugacy: Definitions and Lemmas
نویسندگان
چکیده
منابع مشابه
Stable Conjugacy: Definitions and Lemmas
The purpose of the present note is to introduce some notions useful for applications of the trace formula to the study of the principle of functoriality, including base change, and to the study of zeta-functions of Shimura varieties. In order to avoid disconcerting technical digressions I shall work with reductive groups over fields of characteristic zero, but the second assumption is only a ma...
متن کاملRegularity Lemmas for Stable Graphs
We develop a framework in which Szemerédi’s celebrated Regularity Lemma for graphs interacts with core model-theoretic ideas and techniques. Our work relies on a coincidence of ideas from model theory and graph theory: arbitrarily large half-graphs coincide with model-theoretic instability, so in their absence, structure theorems and technology from stability theory apply. In one direction, we ...
متن کاملPolymorphic Lemmas and Definitions in lambda-Prolog and Twelf
λProlog is known to be well-suited for expressing and implementing logics and inference systems. We show that lemmas and definitions in such logics can be implemented with a great economy of expression. We encode a higher-order logic using an encoding that maps both terms and types of the object logic (higher-order logic) to terms of the metalanguage (λProlog). We discuss both the Terzo and Tey...
متن کاملAsserting Lemmas in the Stable Model Semantics
From a logic programming point of view, the stable model semantics for normal programs has the problem that logical consequences of programs cannot, in general, be stored as lemmas. This is because the set of stable models of the resulting program may change. In fact, logical consequence under the stable model semantics does not enjoy an important property required of non–monotonic entailment r...
متن کاملTwelve Definitions of a Stable Model
This is a review of some of the definitions of the concept of a stable model that have been proposed in the literature. These definitions are equivalent to each other, at least when applied to traditional Prologstyle programs, but there are reasons why each of them is valuable and interesting. A new characterization of stable models can suggest an alternative picture of the intuitive meaning of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Mathematics
سال: 1979
ISSN: 0008-414X,1496-4279
DOI: 10.4153/cjm-1979-069-2